Route to engineering nanoparticle crystallinity
نویسندگان
چکیده
منابع مشابه
The Effect of PtRuIr Nanoparticle Crystallinity in Electrocatalytic Methanol Oxidation
Two structural forms of a ternary alloy PtRuIr/C catalyst, one amorphous and one highly crystalline, were synthesized and compared to determine the effect of their respective structures on their activity and stability as anodic catalysts in methanol oxidation. Characterization techniques included TEM, XRD, and EDX. Electrochemical analysis using a glassy carbon disk electrode for cyclic voltamm...
متن کاملNanoparticle surfactants as a route to bicontinuous block copolymer morphologies.
The surface chemistry of nanoparticles can be modified so that these particles behave like surfactants and localize at interfaces between two fluids. We demonstrate that small volume fractions phi(P) of such surfactant nanoparticles added to lamellar diblock copolymers lead initially to a decrease in lamellar thickness with phi(P), a consequence of decreasing interfacial tension, up to a critic...
متن کاملEngineering Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-depend...
متن کاملNanoparticle superlattice engineering with DNA.
A current limitation in nanoparticle superlattice engineering is that the identities of the particles being assembled often determine the structures that can be synthesized. Therefore, specific crystallographic symmetries or lattice parameters can only be achieved using specific nanoparticles as building blocks (and vice versa). We present six design rules that can be used to deliberately prepa...
متن کاملEngineering Fast Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s algorithm. We outline ideas, algorithms, implementations, and experimental methods behind this development. We also explain why the story is not over yet because dynamically changing networks, flexible objective function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Materials Today
سال: 2007
ISSN: 1369-7021
DOI: 10.1016/s1369-7021(07)70222-5